Towards a formal model of natural language description based on restarting automata with parallel DR-structures
نویسندگان
چکیده
We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures capture the correspondence of dependency trees on different layers of linguistic description, namely layer of surface syntax and layer of language meaning. The novelty of this contribution consists in (i) the extension of enhanced restarting automata in order to produce tree structures with several interlinked layers and (ii) the application of these automata to the stratificational description of a natural language.
منابع مشابه
(In)Dependencies in Functional Generative Description by Restarting Automata
We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures...
متن کاملRestarting Automata with Structured Output and Functional Generative Description
Restarting automata were introduced for modeling linguistically motivated analysis by reduction. In this paper we enhance these automata with a structured output in the form of a tree. Enhanced restarting automata can serve as a formal framework for the Functional Generative Description. In this framework, a natural language is described at four layers. Working simultaneously with all these lay...
متن کاملRestarting automata and pre x-rewriting systems
Jan car et al (1995) developed the restarting automaton as a formal model of certain syn-tactical aspects of natural languages. Here we mainly concentrate on the deterministic version of the restarting automaton and its variants, establishing some inclusion results for the class of Church-Rosser languages. In addition, it is shown that there is a close correspondence between various classes of ...
متن کاملOn Restarting Automata with Rewriting
Motivated by natural language analysis we introduce restarting automata with rewriting. They are acceptors on the one hand, and (special) regulated rewriting systems on the other hand. The computation of a restarting automaton proceeds in cycles: in each cycle, a bounded substring of the input word is rewritten by a shorter string, and the computation restarts on the arising shorter word. We sh...
متن کاملValency Lexicon of Czech Verbs: Towards Formal Description of Valency and Its Modeling in an Electronic Language Resource
Valency refers to the capacity of verb (or a word belonging to another part of speech) to take a specific number and type of syntactically dependent language units. Valency information is thus related to particular lexemes and as such it is necessary to describe valency characteristics for separate lexemes in the form of lexicon entries. A valency lexicon is indispensable for any complex Natura...
متن کامل